2

The traveling-salesman problem and minimum spanning trees: Part II

Year:
1971
Language:
english
File:
PDF, 644 KB
english, 1971
3

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

Year:
1973
Language:
english
File:
PDF, 626 KB
english, 1973
4

The Traveling-Salesman Problem and Minimum Spanning Trees

Year:
1970
Language:
english
File:
PDF, 623 KB
english, 1970
5

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Year:
1972
Language:
english
File:
PDF, 792 KB
english, 1972
9

The Traveling-Salesman Problem and Minimum Spanning Trees

Year:
1970
Language:
english
File:
PDF, 1.14 MB
english, 1970
11

The Rescue Complex in Anna O’S Final Identity

Year:
1961
Language:
english
File:
PDF, 1.19 MB
english, 1961
12

An algorithm to solve the m × n assignment problem in expected time O(mn log n)

Year:
1980
Language:
english
File:
PDF, 428 KB
english, 1980
13

A phenomenon in the theory of sorting

Year:
1972
Language:
english
File:
PDF, 492 KB
english, 1972
14

Searching for an optimal path in a tree with random costs

Year:
1983
Language:
english
File:
PDF, 690 KB
english, 1983
15

ACM Turing Award Lectures || Combinatorics, complexity, and randomness

Year:
2007
Language:
english
File:
PDF, 1.07 MB
english, 2007
16

An introduction to randomized algorithms

Year:
1991
Language:
english
File:
PDF, 2.92 MB
english, 1991
17

Competitive paging algorithms

Year:
1991
Language:
english
File:
PDF, 949 KB
english, 1991
18

The transitive closure of a random digraph

Year:
1990
Language:
english
File:
PDF, 1.21 MB
english, 1990
28

The rank of sparse random matrices over finite fields

Year:
1997
Language:
english
File:
PDF, 182 KB
english, 1997
29

Error-resilient DNA computation

Year:
1999
Language:
english
File:
PDF, 212 KB
english, 1999
30

Algorithms for graph partitioning on the planted partition model

Year:
2001
Language:
english
File:
PDF, 192 KB
english, 2001
32

Two special cases of the assignment problem

Year:
1975
File:
PDF, 1.26 MB
1975
33

The complexity of parallel search

Year:
1988
Language:
english
File:
PDF, 1.80 MB
english, 1988
34

Parametric shortest path algorithms with an application to cyclic staffing

Year:
1981
Language:
english
File:
PDF, 991 KB
english, 1981
35

Subtree isomorphism is in random NC

Year:
1990
Language:
english
File:
PDF, 2.08 MB
english, 1990
36

Monte-Carlo approximation algorithms for enumeration problems

Year:
1989
Language:
english
File:
PDF, 1.02 MB
english, 1989
37

Transitive compaction in parallel via branchings

Year:
1991
Language:
english
File:
PDF, 1000 KB
english, 1991
38

Parallel minimax search for a maximum

Year:
1968
Language:
english
File:
PDF, 626 KB
english, 1968
39

Understanding Science Through the Computational Lens

Year:
2011
Language:
english
File:
PDF, 811 KB
english, 2011
41

My memories of David Gale

Year:
2009
Language:
english
File:
PDF, 74 KB
english, 2009
43

Deferred Data Structuring

Year:
1988
Language:
english
File:
PDF, 2.46 MB
english, 1988
44

On Linear Characterizations of Combinatorial Optimization Problems

Year:
1982
Language:
english
File:
PDF, 1.47 MB
english, 1982
45

Finite-State Processes and Dynamic Programming

Year:
1967
Language:
english
File:
PDF, 2.79 MB
english, 1967
47

Reconstructing Boolean Models of Signaling

Year:
2013
Language:
english
File:
PDF, 173 KB
english, 2013